Type-Raising and Directionality in Combinatory Grammar

نویسنده

  • Mark Steedman
چکیده

The form of rules in combinatory categorial grammars (CCG) is constrained by three principles, called "adjacency", "consistency" and "inheritance". These principles have been claimed elsewhere to constrain the combinatory rules of composition and type raising in such a way as to make certain linguistic universals concerning word order under coordination follow immediately. The present paper shows that the three principles have an extremely natural expression in a unification-based interpretation of CCG in which directional information is an attribute of the arguments of functions grounded in string position. The aforementioned universals can thereby be derived as consequences of more elementary assumptions. Some desirable results follow, concerning type-raising and the parser. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-91-11. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/390 Type-Raising And Direct ionality In Combinatory Grammar MS-CIS-91-11 LINC LAB 192

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Type-Driven Tensor-Based Semantics for CCG

This paper shows how the tensor-based semantic framework of Coecke et al. can be seamlessly integrated with Combinatory Categorial Grammar (CCG). The integration follows from the observation that tensors are linear maps, and hence can be manipulated using the combinators of CCG, including type-raising and composition. Given the existence of robust, wide-coverage CCG parsers, this opens up the p...

متن کامل

Normal-form parsing for Combinatory Categorial Grammars with generalized composition and type-raising

We propose and implement a modification of the Eisner (1996) normal form to account for generalized composition of bounded degree, and an extension to deal with grammatical type-raising.

متن کامل

Predictive Combinators: a Method for Efficient Processing of Combinatory Categorial Grammars

A B S T R A C T Steedman (1985, 1987) and others have proposed that Categorial Grammar, a theory of syntax in which grammatical categories are viewed as functions, be augmented with operators such as functional composition and type raising in order to analyze • noncanonical" syntactic constructions such as whextraction and node raising. A consequence of these augmentations is an explosion of se...

متن کامل

Naacl 2000 Submission Hhandling Some Diicult Problems in Morpho-syntactic Modeling of Korean Using Categorial Grammari

Korean Combinatory Categorial Grammar (KCCG) is an extended combinatory categorial grammar formalism that can capture the syntax and interpretation of the \relative free" word order, long distance scrambling and other characteristics of Korean. The KCCG formalism can uniformly handle word order variation among arguments and adjuncts within a clause as well as in complex clauses and across claus...

متن کامل

Generative Power of CCGs with Generalized Type-Raised Categories

This paper shows that a class of Combinatory Categorial Grammars (CCGs) augmented with a linguistically-motivated form of type raising involving variables is weakly equivalent to the standard CCGs not involving variables. The proof is based on the idea that any instance of such a grammar can be simulated by a standard CCG.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991